Seek Distances in Two-Headed Disk Systems
نویسندگان
چکیده
We make a correction to the calculation of mean seek time in a recent algorithm of intelligently positioned two headed disk systems. We also introduce a new two headed disk system with better mean seek time.
منابع مشابه
Seek Distances in Disks with Two Independent Heads Per Surface
Two-headed disk systems are commercially available, however their special characteristics are not broadly studied. As categorized in [5], these systems may have (a) two arms autonomously controlled, (b) two arms and a single controller or, finally, (c) a single arm with two fixed heads. The last case is examined in [1,3,6-81, the second case is examined in [2], while the first case is examined,...
متن کاملOptimal Data Placement In
A problem inherent to the performance of disk systems is the data placement in cyinders in such a way that the seek time is minimized. If successive searchers are independent, then the optimal placement for conventional one-headed disk systems is the organ-pipe arrangement. According to this arrangement the most frequent cylinder is placed in the central location, while the less frequent cylind...
متن کاملThe Two Headed Disk: Stochastic Dominance of the Greedy Policy
In his paper “Should the two-headed disk be greedy? Yes, it should” Hofri defined a “greedy policy” as follows. Assuming that the range of disk addresses is [OJ], a request at location x is served by the closest arm while the other arm jockeys to a new position, z, where z = (1/3)x or z = 2/3 +x/3 depending on whether x is larger or smaller than l/2. Hofri proved that this policy minimizes the ...
متن کاملGender Differentials in Food Output and Food Security in Anambra State Southeast Nigeria
The study assessed the quantity and value of food crop outputs of the gender categories in the Anambra state. At this research estimated the quantity and energy content of food stuffs consumed as well as required by each gender headed households, estimated the extent and magnitude of food security and insecurity in the area among the gender categories and examined the determinants of food secur...
متن کاملA Tight Upper Bound of the Lumped Disk Seek Time for the Scan Disk Scheduling Policy
A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy is presented. The tight upper bound is based on an accurate disk seek time model. One of the most important applications of the tight upper bound is in multimedia storage system design. Without a tight upper bound based on an accurate disk seek time model, the designers of multimedia storage systems would be fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 57 شماره
صفحات -
تاریخ انتشار 1996